Two-player entangled games are NP-hard
نویسندگان
چکیده
We show that the maximum success probability of players sharing quantum entanglement in a twoplayer game with classical questions of logarithmic length and classical answers of constant length is NP-hard to approximate to within constant factors. As a corollary, the inclusion NEXP ⊆ MIP∗, first shown in [IV12] with three provers, holds with two provers only. The proof is based on a simpler, improved analysis of the low-degree test Raz and Safra (STOC’97) against two entangled provers.
منابع مشابه
CS286.2 Lecture 15: Tsirelson’s characterization of XOR games
We first recall the notion of quantum multi-player games: a quantum k-player game involves a verifier V and k players P1, . . . , Pk. The verifier randomly picks an index i according to some distribution π over the set {1, . . . , Q} and sends a quantum state |φi〉 (the question) to the the players. Here |φi〉 consists of k quantum registers, |φi〉 = |φi〉P1···Pk , but it is not necessarily a produ...
متن کاملReachability Switching Games
In this paper, we study the problem of deciding the winner of reachability switching games. These games provide deterministic analogues of Markovian systems. We study zero-, one-, and two-player variants of these games. We show that the zero-player case is NL-hard, the one-player case is NP-complete, and that the two-player case is PSPACE-hard and in EXPTIME. In the oneand two-player cases, the...
متن کاملFinding Equilibria in Games of No Chance
We consider finding maximin strategies and equilibria of explicitly given extensive form games with imperfect information but with no moves of chance. We show: 1. A maximin pure strategy for a two-player extensive form game with perfect recall and no moves of chance can be found in time linear in the size of the game tree. In contrast, it is known that this problem is NP-hard for games with cha...
متن کاملar X iv : 0 70 4 . 29 03 v 2 [ qu an t - ph ] 2 1 N ov 2 00 7 Entangled games are hard to approximate
We establish the first hardness results for the problem of computing the value of one-round games played by a verifier and a team of provers who can share quantum entanglement. In particular, we show that it is NP-hard to approximate within an inverse polynomial the value of a one-round game with (i) quantum verifier and two entangled provers or (ii) classical verifier and three entangled prove...
متن کامل2 4 A ug 2 00 9 Entangled games do not require much entanglement
We prove an explicit upper bound on the amount of entanglement required by any strategy in a two-player cooperative game with classical questions and quantum answers. Specifically, we show that every strategy for a game with n-bit questions and n-qubit answers can be implemented exactly by players who share an entangled state of no more than 5n qubits—a bound which is optimal to within a factor...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1710.03062 شماره
صفحات -
تاریخ انتشار 2017